This is a 23-lecture series on Image Processing that I have created over the past 17 years (1999-2015) for my course, EECE 4353 / 5353, at the Vanderbilt University School of Engineering. The files are all in Adobe Acrobat (.pdf) format and MS Powerpoint (.ppt) format. They are quite large because of the images in them. The topics covered include: Image Enhancement by Point Operations, Color Correction, The 2-D Fourier Transform and Convolution, Linear Spatial Filtering, Image Sampling and... favoritefavoritefavoritefavorite ( 23 reviews ) Topics: image processing, image enhancement, image noise reduction, Fourier transforms, convolution,...
This course covers the mathematical topics most directly related to computer science. Topics include: logic, relations, functions, basic set theory, countability and counting arguments, proof techniques, mathematical induction, graph theory, combinatorics, discrete probability, recursion, recurrence relations, and number theory. Emphasis is placed on providing a context for the application of the mathematics within computer science. The analysis of algorithms requires the ability to count the... favoritefavoritefavoritefavorite ( 15 reviews ) Topics: ars digita, computer science, discrete math, logic, proof techniques, recurrence relations, basic...
A basic introduction to the Calculus and Linear Algebra. The goal is to make students mathematically literate in preparation for studying a scientific/engineering discipline. The first week covers differential calculus: graphing functions, limits, derivatives, and applying differentiation to real-world problems, such as maximization and rates of change. The second week covers integral calculus: sums, integration, areas under curves and computing volumes. This is not meant to be a comprehensive... Topics: ars digita, calculus, linear algebra
A theoretical treatment of what can be computed and how fast it can be done. Applications to compilers, string searching, and control circuit design will be discussed. The hierarchy of finite state machines, pushdown machines, context free grammars and Turing machines will be analyzed, along with their variations. The notions of decidability, complexity theory and a complete discussion of NP-Complete problems round out the course. Text: Introduction to the Theory of Computation, Michael Sipser.... favoritefavoritefavoritefavoritefavorite ( 8 reviews ) Topic: computation
This class covers the definition of a function, vertical line test, function notation, finding input and output, domain and range, plus homework assignments. favoritefavoritefavoritefavorite ( 1 reviews ) Topics: Mathematics, Calculus, Advanced Placement
Learn about the first Americans, the voyage of Christopher Columbus, and Cortez' defeat of the Aztecs. To watch the interactive media files (see left-hand column) first click the link to open it, then right-click anywhere on the page and select "play". favoritefavorite ( 4 reviews ) Topics: American History, Advanced Placement
An introduction to programming and the power of abstraction, using Abelson and Sussman's classic textbook of the same name. Key concepts include: building abstractions, computational processes, higher-order procedures, compound data, data abstractions, controlling interactions, generic operations, self-describing data, message passing, streams and infinite data structures, meta-linguistic abstraction, interpretation of programming languages, machine model, compilation, and embedded languages.... favoritefavoritefavoritefavorite ( 1 reviews ) Topics: ars digita, computer science, programming, abstraction